A Proposal of PSO Particles' Initialization for Costly Unconstrained Optimization Problems: ORTHOinit
نویسندگان
چکیده
A proposal for particles’ initialization in PSO is presented and discussed, with focus on costly global unconstrained optimization problems. The standard PSO iteration is reformulated such that the trajectories of the particles are studied in an extended space, combining particles’ position and speed. To the aim of exploring effectively and efficiently the optimization search space since the early iterations, the particles are initialized using sets of orthogonal vectors in the extended space (orthogonal initialization, ORTHOinit). Theoretical derivation and application to a simulation-based optimization problem in ship design are presented, showing the potential benefits of the current approach.
منابع مشابه
PSO for multi-objective problems: Criteria for leader selection and uniformity distribution
This paper proposes a method to solve multi-objective problems using improved Particle Swarm Optimization. We propose leader particles which guide other particles inside the problem domain. Two techniques are suggested for selection and deletion of such particles to improve the optimal solutions. The first one is based on the mean of the m optimal particles and the second one is based on appoin...
متن کاملTheoretical Analysis of Initial Particle Swarm Behavior
In this paper, particle trajectories of PSO algorithms in the first iteration are studied. We will prove that many particles leave the search space at the beginning of the optimization process when solving problems with boundary constraints in high-dimensional search spaces. Three different velocity initialization strategies will be investigated, but even initializing velocities to zero cannot ...
متن کاملLow Discrepancy Initialized Particle Swarm Optimization for Solving Constrained Optimization Problems
Population based metaheuristics are commonly used for global optimization problems. These techniques depend largely on the generation of initial population. A good initial population may not only result in a better fitness function value but may also help in faster convergence. Although these techniques have been popular since more than three decades very little research has been done on the in...
متن کاملAn Orthogonal Multi-Swarm Cooperative PSO Algorithm with a Particle Trajectory Knowledge Base
A novel orthogonal multi-swarm cooperative particle swarm optimization (PSO) algorithm with a particle trajectory knowledge base is presented in this paper. Different from the traditional PSO algorithms and other variants of PSO, the proposed orthogonal multi-swarm cooperative PSO algorithm not only introduces an orthogonal initialization mechanism and a particle trajectory knowledge base for m...
متن کاملStudy on an Improved PSO Algorithm and its Application for Solving Function Problem
Particle swarm optimization(PSO) algorithm has the advantages of simplicity and easy implementation, but it exits the weaknesses of the being easy to fall into local minimum and premature convergence. In order to overcome these weaknesses of PSO algorithm, the inertia weight and learning factor are improved and the PSO algorithm is initialized by using chaotic optimization in order to propose a...
متن کامل